Fast Deterministic Computations on a Faulty PRAM
نویسنده
چکیده
We develop a method to simulate deterministically the operational Parallel Random Access Machine (PRAM) on a PRAM prone to processor and memory failures. It is shown that an n-processor PRAM with a bounded fraction of faulty processors and memory cells can simulate de-terministically the fully operational PRAM with O(log n) slowdown, after preprocessing performed in time O(log 2 n).
منابع مشابه
Fast Deterministic Simulation of Computations on Faulty Parallel Machines
A method of deterministic simulation of fully operational parallel machines on the analogous machines prone to errors is developed. The simulation is presented for the exclusive-read exclusive-write (EREW) PRAM and the Optical Communication Parallel Computer (OCPC), but it applies to a large class of parallel computers. It is shown that simulations of operational multiprocessor machines on faul...
متن کاملDeterministic Computations on a PRAM with Static Processor and Memory Faults
We consider Parallel Random Access Machine (PRAM) which has some processors and memory cells faulty. The faults considered are static, i.e., once the machine starts to operate, the operational/faulty status of PRAM components does not change. We develop a deterministic simulation of a fully operational PRAM on a similar faulty machine which has constant fractions of faults among processors and ...
متن کاملA Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem
A simple parallel randomized algorithm to find a maximal independent set in a graph G = (V, E) on n vertices is presented. Its expected rmming time on a concurrent-read concurrent-write PRAM with 0( 1 E 1 d,,) processors is O(log n), where d,, denotes the maximum degree. On an exclusive-read exclusive-write PRAM with 0( 1 El) processors the algorithm runs in O(log2n). Previously, an O(log4n) de...
متن کاملReliable Computations on Faulty EREW PRAM
We consider the problem of efficient and reliable computing on EREW PRAM whose processors are subject to random independent stop-failures with constant probability p < 1. An algorithm for such a fault-prone machine is called safe if it solves a problem of size n with probability exceeding 1 d/n, for some constant d independent of n. Our main contribution is a safe algorithm for the well-known l...
متن کاملFast parallel recognition of LR language suffixes
It is shown that suffix recognition for deterministic context-free languages can be done on a PRAM multi-processor within the upper complexity bounds of the graph reachability problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007